Hierarchical Radiosity for Dynamic Environments

نویسنده

  • Erin Shaw
چکیده

This paper extends the hierarchical radiosity method to environments in which geometry and surface attributes can be changed dynamically. New algorithms are presented for maintaining an appropriately-sized mesh and speeding the construction of the corresponding linear system. Mesh folding, the unrefinement of a mesh, is used to optimize mesh size while maintaining a specified error tolerance. Two new interactions are introduced: shadow links guide local shadow clean up after a change in geometry and ghost links guide global mesh folding after a change in surface attributes. The algorithms stabilize the memory requirements of dynamic scenes. Different types of interactions are analyzed to determine how they are affected by changes in geometry. A dynamic scene-partitioning scheme called a motion volume, used in conjunction with a three-dimensional clipping algorithm, provides a fast way to cull interactions that do not need to be updated. The algorithms are demonstrated on several sample scenes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering-Based Hierarchical Radiosity for Dynamic Environments

This paper extends hierarchical radiosity and clustering techniques to dynamic environments, in which dynamic manipulations, such as repositioning an object and changing surface attributes, are repeatedly applied. The cluster techniques can be effective in reducing the computational complexity of both initial linking creation and link updating of dynamic manipulations. When the object is reposi...

متن کامل

Eecient Radiosity in Dynamic Environments

A method of determining radiosity in an environment containing moving objects, is described. This method uses the hierarchical techniques of Hanrahan et al. to obtain a static solution. Hanrahan's techniques e ciently create a hierarchical meshing of the environments geometry, and create links from element to element based on the magnitude of the form-factor between the elements. These ideas ex...

متن کامل

Getting Rid of Links in Hierarchical Radiosity

Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using hierarchical radiosity for complex scenes is still problematic due to the necessity of storing a large number of transport coefficients between surfaces in the form of links. In this paper, we eliminate the need for st...

متن کامل

High Quality Final Gathering for Hierarchical Monte Carlo Radiosity for General Environments

Aiming at rendering high quality images robustly for general environments with simple algorithms, we use a two-pass method that accounts for the global illumination. In this paper we present the integration of a new gathering procedure in the rendering pass, that uses the approximate results obtained by a particle tracing method, an extension of the Hierarchical Monte Carlo Radiosity (HMCR) alg...

متن کامل

Wavelet Projections for Radiosity

One important goal of image synthesis research is to accelerate the process of obtaining realistic images using the radiosity method. Two important concepts recently introduced are the general framework of projection methods and the hierarchical radiosity method. Wavelet theory, which explores the space of hierarchical basis functions, offers an elegant framework that unites these two concepts ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1997